- maximal string
- (maximum-length sequence) последовательность максимальной длины, максимальная последовательность
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
maximal string
Смотреть что такое "maximal string" в других словарях:
String metric — String metrics (also known as similarity metrics) are a class of textual based metrics resulting in a similarity or dissimilarity (distance) score between two pairs of text strings for approximate matching or comparison and in fuzzy string… … Wikipedia
Maximal pair — Given a string S of length n, a maximal pair is a tuple (p1,p2,l), such that S[p1..p1 + l − 1] = S[p2..p2 + l − 1], but and . A maximal repeat is a string represented by such tuple. A supermaximal repeat is a maximal repeat never occurring as a… … Wikipedia
Type II string theory — In theoretical physics, type II string theory is a unified term that includes both type IIA strings and type IIB strings. These account for two of the five consistent superstring theories in ten dimensions. Both theories have the maximal amount… … Wikipedia
Bit-String — [dt. Bitfolge, Bitreihe, Bitkette], Datentyp zur Manipulation von binären Werten. Eine Bit Folge der Länge x stellt eine Abfolge von x Bits dar, die durch binäre Operatoren bzw. Funktionen abgefragt, gesetzt und verändert werden können. Bei… … Universal-Lexikon
LZWL — is a syllable based variant of the character based LZW compression algorithm. LZWL can work with syllables obtained by all algorithms of decomposition into syllables. This algorithm can be used for words too.yllablesAccording Compact Oxford… … Wikipedia
Supergravity — In theoretical physics, supergravity (supergravity theory) is a field theory that combines the principles of supersymmetry and general relativity. Together, these imply that, in supergravity, the supersymmetry is a local symmetry (in contrast to… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
test — 1. To prove; to try a substance; to determine the chemical nature of a substance by means of reagents. 2. A method of examination, as to determine the presence or absence of a definite disease or of some substance in any of the fluids, tissues,… … Medical dictionary
Generalized complex structure — In the field of mathematics known as differential geometry, a generalized complex structure is a property of a differential manifold that includes as special cases a complex structure and a symplectic structure. Generalized complex structures… … Wikipedia
Event symmetry — The term Event symmetry describes invariance principles that have been used in some discrete approaches to quantum gravity where the diffeomorphism invariance of general relativity can be extended to a covariance under any permutation of… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
